Day 13 문자열, 배열, 사칙연산, 수학, 조건문

Day13 13단계 20231101

1. 컨트롤 제트

class Solution {
    public int solution(String s) {
        String[] str = s.split(" ");
        int minus = 0;
        int answer = 0;
        for (int i = 0; i < str.length; i++) {
            if (str[i].equals("Z")) {
                answer -= Integer.parseInt(str[i-1]);
                continue;
            }
            answer += Integer.parseInt(str[i]);
        }
        return answer;
    }
}
import java.util.*;
String str = "1 2 Z 3";
int answer = 0;
Stack<Integer> stack = new Stack<>();
for(String s : str.split("")) {
	if(s.equals("Z")) { stack.pop(); }
	else { stack.push(Integer.parseInt(s)); }
}
for(int i : stack) { answer += i; }

2. 배열 원소의 길이

class Solution {
    public int[] solution(String[] strlist) {
        int[] answer = new int[strlist.length];
        for (int i = 0; i < strlist.length; i++) {
            answer[i] = strlist[i].length();
        }
        return answer;
    }
}
Arrays.streamlength).toArray(;

3. 중복된 문자 제거

import java.util.*;
import java.util.stream.Collectors;
class Solution {
    public String solution(String my_string) {
        List<Character> list = new ArrayList<>();
        for(int i = 0; i < my_string.length(); i++) {
            if(!list.contains(my_string.charAt(i))) {
                list.add(my_string.charAt(i));
            }
        }
        return list.streamvalueOf).collect(Collectors.joining();
    }
}
my_string.charstoString).distinct().collect(Collectors.joining()
String[] str = my_string.split("");
Set<String> set = new LinkedHashSet<String>(Arrays.asList(str));
String.join("", set);
String answer = "";
for(int i = 0; i < my_string.length(); i++) {
	if (i == my_string.indexOf(my_string.charAt(i))) {
		answer += my_string.charAt(i);
	}
}